Behaviour equivalent max-plus automata for timed petri nets under open-loop race-policy semantics

Abstract Timed Petri nets and max-plus automata are well known modelling frameworks for timed discrete-event systems. In this paper we present an iterative procedure that constructs a automaton from net while retaining the behaviour. Regarding net, essentially impose three assumptions: (a) must be bounded, i.e, reachability graph finite; (b) interpret with single server semantics; (c) operates according to race policy, i.e., earliest possible transition will fire thereby possibly consume tokens required by other competing transitions. Under these assumptions show proposed terminates finite deterministic realises same behaviour as net. As variation of plain also consider subsequently designed supervisor may temporarily disable distinguished Again, terminating equivalent automaton. We demonstrate example how latter can utilised open-loop model in context control.